Techniques for Solving Travelling Sales Man Problem
نویسندگان
چکیده
Paper here defines the Travelling Sales Man Problem(TSP) as a problem where Salesman desires to tour around a specified set of cities, and return to the starting city, covering the least total distance. TSP is a NP-hard problem for reducing their complexity we use the different type of techniques. TSP can be solved by multiple techniques such as Parallel search-and-learn technique, Hybrid Method, Neural Network Techniques, Tabu search and Genetic Algorithm. Genetic Algorithm gives the best possible solution for solving TSP problem.
منابع مشابه
Study of Various Mutation Operators in Genetic Algorithms
Genetic Algorithms are the population based search and optimization technique that mimic the process of natural evolution. Different crossover and mutation operators exist to solve the problem that involves large population size. Example of such a problem is travelling sales man problem, which is having a large set of solution. In this paper we will discuss different mutation operators that hel...
متن کاملA Particle Swarm Optimization and Fuzzy Based Algorithm for Solving Classical Travelling Sales Person Problem
Travelling Sales Person Problem is one of the classical combinatorial optimization problems that belong to the NP-complete class. It is the problem of finding the optimized path for a given set of cities. The path is drawn in such a way that the salesperson has to visit each city exactly once. This paper provides an efficient method for solving the classical Travelling Sales Person Problem by u...
متن کاملStudy of Various Crossover Operators in Genetic Algorithms
Genetic Algorithms are the population based search and optimization technique that mimic the process of natural evolution. Performance of genetic algorithms mainly depends on type of genetic operators – Selection, Crossover, Mutation and Replacement used in it. Different crossover and mutation operators exist to solve the problem that involves large population size. Example of such a problem is...
متن کاملA CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES
A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...
متن کاملA modified elite ACO based avoiding premature convergence for travelling salesmen problem
The Travelling Salesmen Problem (TSP) is one of the most important and famous combinational optimization problems that aim to find the shortest tour. In this problem, the salesman starts to move from an arbitrary place called depot and after visiting all nodes, finally comes back to depot. Solving this problem seems hard because program statement is simple and leads this problem belonging to NP...
متن کامل